Root finding by high order iterative methods based on quadratures
نویسندگان
چکیده
We discuss a recursive family of iterative methods for the numerical approximation of roots of nonlinear functions in one variable. These methods are based on Newton-Cotes closed quadrature rules. We prove that when a quadrature rule with n+ 1 nodes is used the resulting iterative method has convergence order at least n+ 2, starting with the case n = 0 (which corresponds to the Newton’s method).
منابع مشابه
THIRD-ORDER AND FOURTH-ORDER ITERATIVE METHODS FREE FROM SECOND DERIVATIVE FOR FINDING MULTIPLE ROOTS OF NONLINEAR EQUATIONS
In this paper, we present two new families of third-order and fourth-order methods for finding multiple roots of nonlinear equations. Each of them requires one evaluation of the function and two of its first derivative per iteration. Several numerical examples are given to illustrate the performance of the presented methods.
متن کاملA Third Order Iterative Method for Finding Zeros of Nonlinear Equations
In this paper, we present a new modification of Newton's method for finding a simple root of a nonlinear equation. It has been proved that the new method converges cubically.
متن کاملFinding the polar decomposition of a matrix by an efficient iterative method
Theobjective in this paper to study and present a new iterative method possessing high convergence order for calculating the polar decompostion of a matrix. To do this, it is shown that the new scheme is convergent and has high convergence. The analytical results are upheld via numerical simulations and comparisons.
متن کاملNew Ninth Order Iterative Methods for Finding Multiple Roots of Nonlinear Equations
In this paper, four new ninth order iterative methods for solving nonlinear equations are constructed. It is proved that these methods have the convergence order of nine requiring six function evaluations per iteration. Numerical comparisons are included to demonstrate exceptional convergence speed of the proposed methods.
متن کاملTwo Fourth-order Iterative Methods Based on Continued Fraction for Root-finding Problems
In this paper, we present two new one-step iterative methods based on Thiele’s continued fraction for solving nonlinear equations. By applying the truncated Thiele’s continued fraction twice, the iterative methods are obtained respectively. Analysis of convergence shows that the new methods are fourth-order convergent. Numerical tests verifying the theory are given and based on the methods, two...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Mathematics and Computation
دوره 264 شماره
صفحات -
تاریخ انتشار 2015